Approximating Extreme Points of Infinite Dimensional Convex Sets
نویسندگان
چکیده
The property that an optimal solution to the problem of minimizing a continuous concave function over a compact convex set in IRn is attained at an extreme point is generalized by the Bauer Minimum Principle to the infinite dimensional context. The problem of approximating and characterizing infinite dimensional extreme points thus becomes an important problem. Consider now an infinite dimensional compact convex set in the nonnegative orthant of the product space IR∞. We show that the sets of extreme points EN of its corresponding finite dimensional projections onto IRN converge in the product topology to the closure of the set of extreme points E of the infinite dimensional set. As an application, we extend the concept of total unimodularity to infinite systems of linear equalities in nonnegative variables where we show when extreme points inherit integrality from approximating finite systems. An application to infinite horizon production planning is considered.
منابع مشابه
C*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings
Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...
متن کاملConvexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملNonexpansive mappings on complex C*-algebras and their fixed points
A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 23 شماره
صفحات -
تاریخ انتشار 1998